package org.feiye.studyday19;

public class Math {
	// 递归调用求阶乘
	public long jiechen(int k) {
		if (k <= 1)
			return 1L;

		return k * jiechen(k - 1);
	}

	// 递归调用求斐波拉切数第k位(1 1 2 3 5 8 13...)
	public long feibolaqie(int k) {
		if (k <= 2)
			return 1L;
		return feibolaqie(k - 1) + feibolaqie(k - 2);

	}

}
